M 2 M Communications System Proposal for Maritime Applications
نویسندگان
چکیده
منابع مشابه
Linearization of M-LINC Systems Using GMP and Particle Swarm Optimization for Wireless Communications
In this paper, an efficient algorithm for the efficiency maximization of the multilevel linear amplification using nonlinear components (M-LINC) systems is proposed regarding the linearity of the system. In this algorithm, we use the generalized memory polynomial (GMP) to provide a behavioral model for the power amplifier (PA) and calculate the power spectral density (PSD) of the output signal ...
متن کاملApplications of Queueing Theory to Circuit Switched Networks Figure 1:ctmc for an M/m/m/m System
In this lesson, we learn about models used for circuit-switched networks. We start with an M/M/m/ m model, also called the m-server loss system [1]. We note here that [2], page 379 states that a system with a finite customer population will always be stable, no matter what value of. This statement is made for any finite state space MC. Does this explain why in M/M/m/m model we often talk about ...
متن کاملStrongly Regular Graphs with Parameters ( 4 m 4 , 2 m 4 + m 2 , m 4 + m 2 , m 4 + m 2 ) Exist for
Using results on Hadamard difference sets, we construct regular graphical Hadamard matrices of negative type of order 4m for every positive integer m. If m > 1, such a Hadamard matrix is equivalent to a strongly regular graph with parameters (4m, 2m +m, m +m, m +m). Strongly regular graphs with these parameters have been called max energy graphs, because they have maximal energy (as defined by ...
متن کاملABS-Type Methods for Solving $m$ Linear Equations in $frac{m}{k}$ Steps for $k=1,2,cdots,m$
The ABS methods, introduced by Abaffy, Broyden and Spedicato, aredirect iteration methods for solving a linear system where the$i$-th iteration satisfies the first $i$ equations, therefore a system of $m$ equations is solved in at most $m$ steps. In thispaper, we introduce a class of ABS-type methods for solving a full rowrank linear equations, w...
متن کاملA New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Journal of Polish Naval Academy
سال: 2017
ISSN: 2657-7291
DOI: 10.5604/01.3001.0010.6744